Worst case fragmentation of first fit and best fit storage allocation strategies

When are best fit and first fit optimal?

Java Memory Allocation with Lazy Worst Fit for Small Objects

Memory allocation is an important part of modern programming languages, including garbagecollected languages such as Java. We propose a fast memory allocation scheme for Java using lazy worst fit (LWF), where pointer increment is used as the primary allocation method and worst fit is used as a backup. We evaluated LWF on a working Java virtual machine with non-moving garbage collection, and the...

Class-based first-fit spectrum allocation with fragmentation avoidance for dynamic flexgrid optical networks

A novel Class-Based First Fit (CBFF) spectrum allocation policy is proposed for dynamic flexgrid optical networks. The effectiveness of the proposed CBFF policy is compared against the First Fit (FF) policy for singlelink and network scenarios. Throughput is shown to be consistently improved under the proposed CBFF policy with throughput gains of up to 15%, compared with the FF policy for the n...

On the Asymptotic Worst Case Behavior of Harmonic Fit

In the parametric bin packing problem we must pack a list of items with size smaller than or equal to 1rr in a minimal number of unit-capacity bins. Among the Ž . approximation algorithms, the class of Harmonic Fit algorithms HF plays an M Ž Ž . . important role. Lee and Lee J. Assoc. Comput. Mach. 32 1985 , 562]572 and Ž Ž . . Galambos Ann. Unï . Sci. Budapest Sect. Comput. 9 1988 , 121]126 pr...

Best-Fit Constructional Analysis

Best-Fit Constructional Analysis